Computational complexity of mathematical operations - PDFSEARCH.IO - Document Search Engine

Computational complexity of mathematical operations
Results: 76

#	Item
31	Generation of Eﬃcient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano Add to Reading List Source URL: www.sic.shibaura-it.ac.jp Language: English - Date: 2014-02-04 09:21:05 Operations research Combinatorial optimization Mathematical optimization NP-complete problems Algorithm Mathematical logic Knapsack problem Optimization problem Genetic algorithm Applied mathematics Theoretical computer science Computational complexity theory
32	Potential and Challenges of Two-VariablePer-Inequality Sub-Polyhedral Compilation Ramakrishna Upadrasta Albert Cohen INRIA and LRI, Paris-Sud 11 University Add to Reading List Source URL: perso.ens-lyon.fr Language: English - Date: 2011-03-29 07:21:24 Operations research Computational complexity theory Convex optimization Linear programming Polyhedron Mathematical optimization Approximation algorithm Simplex algorithm Algorithm Theoretical computer science Applied mathematics Mathematics
33	Channel Based Scheduling of Parallelizable Tasks Jason Glasgow CenterLine Software Cambridge, MA, USA Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-17 12:08:56 Operations research Mathematical optimization Scheduling Parallel computing Job shop scheduling Multiprocessor scheduling Speedup Algorithm Computational complexity theory Theoretical computer science Applied mathematics Concurrent computing
34	Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems Jonathan P. Pearce and Milind Tambe∗ University of Southern California Computer Science Department {, tambe@usc Add to Reading List Source URL: teamcore.usc.edu Language: English - Date: 2008-10-14 04:00:37 Applied mathematics Operations research Distributed constraint optimization Convex optimization Computational complexity theory Constraint satisfaction problem Linear programming Constraint optimization Combinatorial optimization Constraint programming Mathematical optimization Theoretical computer science
35	Hilldale Lecture Series In pursuit of the traveling salesman: Mathematics at the limits of computation Add to Reading List Source URL: www.secfac.wisc.edu Language: English - Date: 2014-10-24 10:53:47 Applied mathematics Travelling salesman problem Mathematical optimization Complexity classes Combinatorial optimization Theoretical computer science Computational complexity theory Operations research
36	(Nearly) Sample-Optimal Sparse Fourier Transform Piotr Indyk MIT Michael Kapralov MIT∗ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Fourier analysis Unitary operators Digital signal processing Computational complexity theory Analysis of algorithms Fourier transform Time complexity Computational complexity of mathematical operations Euclidean algorithm Mathematical analysis Theoretical computer science Mathematics
37	counting colours in compressed strings Travis Gagie Juha K¨arkk¨ainen CPM 2011 Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-22 14:04:56 Arithmetic functions Analysis of algorithms Asymptotic analysis Mathematical notation Number theory Computational complexity of mathematical operations Chebyshev function Mathematics Mathematical analysis Theoretical computer science
38	Multi-Objective Optimisation on Transportation Networks Dan Costelloe, Peter Mooney and Adam Winstanley. Department of Computer Science, National University of Ireland Maynooth (NUIM), Co. Kildare. Ireland. Telephone: +3 Add to Reading List Source URL: itcnt05.itc.nl Language: English - Date: 2005-02-02 17:00:00 Operations research Theoretical computer science Multi-objective optimization Pareto efficiency Routing Algorithm Shortest path problem Computational complexity theory Ant colony optimization algorithms Mathematical optimization Mathematics Applied mathematics
39	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
40	Syntactic Characterizations of Polynomial Time Optimization Classes Prabhu Manyem School of Information Technology and Mathematical Sciences University of Ballarat Mount Helen, VIC 3350, Australia. Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2008-07-15 06:05:48 Complexity classes Computational problems Operations research Optimization problem NP Approximation algorithms Mathematical optimization Time complexity Decision problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE